例句與造句

1. Andrew Yao used these graphs to construct high-dimensional Euclidean minimum spanning trees.
2. The Euclidean minimum spanning tree is the minimum spanning tree of a Euclidean complete graph.
3. Abam, Rahmati, and Zarei provide a significant improvement on exact kinetic maintenance on the Euclidean minimum spanning tree.
4. Thus, for instance, a Euclidean minimum spanning tree is the same as a graph minimum spanning tree in a complete graph with Euclidean edge weights.
5. The Euclidean minimum spanning tree is a spanning tree of a graph with edge weights corresponding to the Euclidean distance between vertices which are points in the plane ( or space ).
6. It's difficult to find euclidean minimum spanning tree in a sentence. 用euclidean minimum spanning tree造句挺難的
7. An obvious application of Euclidean minimum spanning trees is to find the cheapest network of wires or pipes to connect a set of places, assuming the links cost a fixed amount per unit length.
8. His major contributions include an algorithm for approximating the weight of the Euclidean minimum spanning tree in sublinear time, and finding a tight integrality gap for the vertex cover problem using the Frankl R鰀l graphs.
9. Like the relative neighborhood graph, the Urquhart graph of a set of points in general position contains the Euclidean minimum spanning tree of its points, from which it follows that it is a connected graph.
10. For example, the minimum spanning tree of the graph associated with an instance of the Euclidean TSP is a Euclidean minimum spanning tree, and so can be computed in expected O ( " n " log " n " ) time for " n " points ( considerably less than the number of edges ).
11. The "'Euclidean minimum spanning tree "'or "'EMST "'is a minimum spanning tree of a set of " n " points in the plane ( or more generally in  ! " d " ), where the weight of the edge between each pair of points is the Euclidean distance between those two points.
12. However, it is not necessary to construct this graph in order to solve the optimization problem; the Euclidean minimum spanning tree problem, for instance, can be solved more efficiently in " O " ( " n " log " n " ) time by constructing the Delaunay triangulation and then applying a linear time planar graph minimum spanning tree algorithm to the resulting triangulation.